DMMX: Dynamic Memory Management Extension

نویسندگان

  • J. Morris Chang
  • Witawas Srisa-an
  • Chia-Tien Dan Lo
چکیده

Automatic Dynamic Memory Management (ADMM) allows programmers to be more productive, increases system reliability and functionality. However, the true characteristics of these ADMM algorithms are known to be slow and non-deterministic. It is a well known fact that object-oriented applications tend to be dynamic memory intensive. Therefore, it is imperative that the programmers must decide whether or not the benefits of ADMM outweigh the shortcomings. In many object-oriented real-time and embedded systems, the programmers agree that the shortcomings are too severe for ADMM to be used in their applications. Therefore, these programmers while using Java or C++ as the development language, decide to allocate memory either statically or on the stack. In this paper, we present the design of an application specific instruction extension called the Dynamic Memory Management eXtension (DMMX) that would allow automatic dynamic memory management to be done in the hardware. Our highperformance scheme allows both allocation and garbage collection to be done in a predictable fashion. The allocation is done through the modified buddy system which allows constant time object creation. The garbage collection algorithm is mark-sweep, where the sweeping phase can be accomplished in constant time. This hardware scheme would greatly improve the speed and predictability of ADMM. Additionally, our proposed scheme is an addon approach, which allows easy integration into any CPU, hardware implemented Java Virtual Machine (JVM), or Processor in Memory (PIM).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Region-Based Memory Management for a Dynamically-Typed Language

Region-based memory management scheme has been proposed for the programming language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory m...

متن کامل

Effective Factors Influencing on the Implementation of Knowledge Management in the Agricultural Bank of Qom Province

The main objective of the present work was to study the factors affecting the deployment of knowledge management in Agriculture Bank of Qom Province. It was a causative-relational study in terms of data collection. Also, it was a field study, non-experimental in terms of variables control. Sample size was estimated by Morgan table and the data were collected by a questionnaire. The statistical ...

متن کامل

On the Development of Dynamic Real-Time Applications in the RTSJ - A Model for Expressing Dynamic Memory Requirements

The Real-Time Specification for Java (RTSJ) introduces a memory model that includes immortal and scoped memory areas that are not subject to garbage collection latencies. Unfortunately, it is often argued that the RTSJ’s memory model is unwieldy and even insufficiently expressive for describing the memory dynamics of simple and commonly used structures and patterns. This paper takes the positio...

متن کامل

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

Using Garbage Collection in Model Checking

Garbage collection techniques have become common-place in actual programming environments, helping programmers to avoid memory fragmentation and invalid referencing problems. In order to e ciently model check programs that use garbage collection, similar functionalities have to be embedded in model checkers. This paper focuses on the implementation of two classic garbage collection algorithms i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999